Guided Symbolic Universal Planning
نویسندگان
چکیده
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To date, however, no guided algorithms exist for synthesizing universal plans. In this paper, we introduce a general approach for guiding universal planning based on an existing method for heuristic symbolic search in deterministic domains. We present three new sound and complete algorithms for best-first strong, strong cyclic, and weak universal planning. Our experimental results show that guiding the search dramatically can reduce both the computation time and the size of the generated plans.
منابع مشابه
Symbolic LAO* Search for Factored Markov Decision Processes
We describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. It uses state abstraction to avoid evaluating states individually. And it uses forward search from a start state, guided by an admissible heuristic, to avoid evaluating all states. These approaches are combined in a novel way that exploits symbolic model-checking techniq...
متن کاملRepresenting Emotions as Dynamic Interactions of Symbols: A Case Study on Literary Texts
This chapter proposes an emotional architecture organized around three pairs of antithetic universal symbols, or archetypes, derived from analytic psychology and anthropological accounts of mythical thinking. Their functions, relationships and interactions, on different levels of complexity within a dynamical system that mimics human emotional processes, are described by a formal model and a co...
متن کاملaSyMov: A Planner That Deals with Intricate Symbolic and Geometric Problems
We propose an original approach to integrate symbolic task planning and geometric motion and manipulation planning. We focus more particularly on one key aspect: the relation between the symbolic positions and their geometric counterparts. Indeed, we have developed an instantiation process that is able to propagate incrementally task-dependent as well as 3D environment-dependent constraints and...
متن کاملOBDD-Based Optimistic and Strong Cyclic Adversarial Planning
Recently, universal planning has become feasible through the use of efficient symbolic methods for plan generation and representation based on reduced ordered binary decision diagrams (OBDDs). In this paper, we address adversarial universal planning for multi-agent domains in which a set of uncontrollable agents may be adversarial to us. We present two new OBDD-based universal planning algorith...
متن کاملSymbolic Heuristic Search for Probabilistic Planning
We describe a planner that participates in the Probabilistic Planning Track of the 2004 International Planning Competition. Our planner integrates two approaches to solving Markov decision processes with large state spaces. State abstraction is used to avoid evaluating states individually. Forward search from a start state, guided by an admissible heuristic, is used to avoid evaluating all states.
متن کامل